A Cryptanalysis of the Original Domingo-Ferrer’s Algebraic Privacy Homomorphism
نویسندگان
چکیده
We propose a cryptanalysis of the original Domingo-Ferrer’s algebraic privacy homomorphism. We show that the scheme over Zn can be broken by d + 1 known plaintexts in O(d3 log n) time when it has d times expansion through the encryption. Furthermore even when the public modulus n is kept secret, it can be broken by d + 2 known plaintexts in time at most O(d5 log(dn)).
منابع مشابه
A Cryptanalysis of the Original Domingo-Ferrer's Algebraic Privacy Homomophism
We propose a cryptanalysis of the original Domingo-Ferrer’s algebraic privacy homomorphism. We show that the scheme over Zn can be broken by d + 1 known plaintexts in O(d3 log n) time when it has d times expansion through the encryption. Furthermore even when the public modulus n is kept secret, it can be broken by d + 2 known plaintexts in time at most O(d5 log(dn)).
متن کاملKnown-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme
We propose cryptanalysis of the First Domingo-Ferrer’s algebraic privacy homomorphism E :Zn → (Zp ×Zq)d where n= pq. We show that the scheme can be broken by (d+ 1) known plaintexts in O(d3 log2 n) time. Even when the modulus n is kept secret, it can be broken by 2(d + 1) known plaintexts in O(d4 logdn+ d3 log2 n+ ε(m)) time with overwhelming probability. 2005 Elsevier B.V. All rights reserved.
متن کاملImplementation of Homomorphic Encryption Schemes for Secure Packet Forwarding in Mobile Ad Hoc Networks (MANETs)
In this paper we provide a new scheme to securely forward the message in wireless mobile ad hoc networks (MANETs) by using existing homomorphic encryption schemes. This scheme is an alternative for threshold cryptography (TC) in MANETs to securely forward the message. By using homomorphic encryption schemes we remove the computational cost associated with Lagrange Interpolation scheme used in T...
متن کاملPrivacy Homomorphism for Delegation of the Computations
The idea of privacy homomorphism (PH) was firstly introduced by Rivest, Adleman and Dertouzos [1]. They proposed several PHs to process encrypted data without decrypting. A PH is an encryption function which allows the processing the encrypted data without decryption. Formally privacy homomorphism can be defined as an encryption function e which has efficient algorithms to compute e (xy) and e ...
متن کامل